On two families of high order Newton type methods

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Newton-type Methods

Newton’s method is one of the most famous numerical methods. Its origins, as the name suggests, lies in part with Newton, but the form familiar to us today is due to Simpson of “Simpson’s Rule” fame. Originally proposed to find the roots of polynomials it was Simpson who proposed using it for general nonlinear equations and for its use in optimization by finding a root of the gradient. Here we ...

متن کامل

High - order Newton - type iterative methods with memory for solving nonlinear equations ∗

In this paper, we present a new family of two-step Newton-type iterative methods with memory for solving nonlinear equations. In order to obtain a Newton-type method with memory, we first present an optimal two-parameter fourth-order Newton-type method without memory. Then, based on the two-parameter method without memory, we present a new two-parameter Newton-type method with memory. Using two...

متن کامل

Two-step Newton methods

We present sufficient convergence conditions for two-step Newton methods in order to approximate a locally unique solution of a nonlinear equation in a Banach space setting. The advantages of our approach under the same computational cost over other studies such as [9–25] for the semilocal convergence case are: weaker sufficient convergence conditions, more precise error bounds on the distances...

متن کامل

High order Newton-penalty algorithms ?

Recent efforts in differentiable non-linear programming have been focused on interior point methods, akin to penalty and barrier algorithms. In this paper, we address the classical equality constrained program solved using the simple quadratic loss penalty function/algorithm. The suggestion to use extrapolations to track the differentiable trajectory associated with penalized subproblems goes b...

متن کامل

Newton - Type Methods for Stochastic

Stochastic programming is concerned with practical procedures for decision-making under uncertainty , by modelling uncertainties and risks associated with decisions in a form suitable for optimization. The eld is developing rapidly with contributions from many disciplines such as operations research, probability and statistics, and economics. A stochastic linear program with recourse can equiva...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics Letters

سال: 2012

ISSN: 0893-9659

DOI: 10.1016/j.aml.2012.06.004